Experimental Evaluation of Genetic Algorithms to Solve the DNA Assembly Optimization Problem

This paper aims to highlight the motivations for investigating genetic algorithms (GAs) solve DNA Fragment Assembly (DNAFA) problem. DNAFA problem is an optimization that attempts reconstruct original sequence by finding shortest from a given set of fragments. continuation our previous research in which existence polynomial-time reduction into Traveling Salesman Problem (TSP) and Quadratic Assignment (QAP) was discussed. Taking advantage this reduction, work conceptually designed algorithm (GA) platform offers several ingredients enabling us create variants GA solvers problems. The main contribution designing efficient variant carefully integrating different GAs operators platform. For that, individually studied effects on performance solving study has benefiting prior knowledge these contexts TSP QAP best shows significant improvement accuracy (overlap score) reaching more than 172% what reported literature.